Adaptive Population Sizing Schemes in Genetic Algorithms
نویسندگان
چکیده
This chapter presents a review of adaptive population sizing schemes used in genetic algorithms. We start by briefly revisiting theoretical models which rely on a facetwise design decomposition, and then move on to various self-adjusting population sizing schemes that have been proposed in the literature. For each method, the major advantages and disadvantages are discussed. The chapter ends with recommendations for those who design and compare self-adjusting population sizing mechanisms for genetic and evolutionary algorithms.
منابع مشابه
Self-adaptive Population Size Adjustment for Genetic Algorithms
Variable population sizing techniques are rarely considered in the theory of Genetic Algorithms. This paper discusses a new variant of adaptive population sizing for this class of Evolutionary Algorithms. The basic idea is to adapt the actual population size depending on the actual ease or difficulty of the algorithm in its ultimate goal to generate new child chromosomes that outperform their p...
متن کاملAdaptive Population Sizing Genetic Algorithm Assisted Maximum Likelihood Detection of OFDM Symbols in the Presence of Nonlinear Distortions
This paper presents Adaptive Population Sizing Genetic Algorithm (AGA) assisted Maximum Likelihood (ML) estimation of Orthogonal Frequency Division Multiplexing (OFDM) symbols in the presence of Nonlinear Distortions. The proposed algorithm is simulated in MATLAB and compared with existing estimation algorithms such as iterative DAR, decision feedback clipping removal, iteration decoder, Geneti...
متن کاملDynamic Control of Genetic Algorithms in a Noisy Environment
In this paper, we present e cient algorithms for adjusting con guration parameters of genetic algorithms that operate in a noisy environment. Assuming that the population size is given, we address two problems speci cally important in a noisy environment. First, we study the duration-sizing problem that determines dynamically the duration of each generation. Next, we study the sample-allocation...
متن کاملGenetic Algorithms, Noise, and the Sizing of Populations
This paper considers the e ect of stochasticity on the quality of convergence of genetic algorithms (GAs). In many problems, the variance of building-block tness or so-called collateral noise is the major source of variance, and a population-sizing equation is derived to ensure that average signalto-collateral-noise ratios are favorable to the discrimination of the best building blocks required...
متن کاملSTRUCTURAL OPTIMIZATION USING A MUTATION-BASED GENETIC ALGORITHM
The present study is an attempt to propose a mutation-based real-coded genetic algorithm (MBRCGA) for sizing and layout optimization of planar and spatial truss structures. The Gaussian mutation operator is used to create the reproduction operators. An adaptive tournament selection mechanism in combination with adaptive Gaussian mutation operators are proposed to achieve an effective search in ...
متن کامل